Austrian - Japanese Workshop on Symbolic Computation in Software
نویسندگان
چکیده
Rewriting induction (Reddy, 1990) is an automated proof method for inductive theorems of term rewriting systems. Reasoning by the rewriting induction is based on the noetherian induction on some reduction order and the original rewriting induction is not capable of proving theorems which are not orientable by that reduction order. To deal with such theorems, Bouhoula (1995) as well as Dershowitz & Reddy (1993) used the ordered rewriting. However, even using ordered rewriting, the weak capability of non-orientable theorems is considered one of the weakness of rewriting induction approach compared to other automated methods for proving inductive theorems. We present a refined system of rewriting induction with an increased capability of non-orientable theorems and a capability of disproving incorrect conjectures. Soundness for proving/disproving are shown and effectiveness of our system is demonstrated through some examples.
منابع مشابه
WAI'96: II Workshop on Computer Arithmetic, Interval and Symbolic Computation
On August 7-8, 1996, the second Workshop on Computer Arithmetic, Interval and Symbolic Computation was held in Recife, Brazil. The main purpose of the workshop was to bring together researchers interested in scientific computation and related topics and to present and discuss recent advances in this branch of computer science and its applications. Total about 27 talks and 10 posters were presen...
متن کاملComparing Parallel Functional Languages: Programming and Performance
This paper presents a practical evaluation and comparison of three state-of-the-art parallel functional languages. The evaluation is based on implementations of three typical symbolic computation programs, with performance measured on a Beowulf-class parallel architecture. ∗This work is primarily supported by the Austrian Academy of Sciences (APART fellowship 624), the Japan Society for the Pro...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملThe Design of the PACLIB Kernel
This paper describes the runtime kernel of paclib, a new system for parallel algebraic computation on shared memory computers. paclib has been developed as a professional tool for the simple design and eecient implementation of parallel algorithms in computer algebra and related areas. It provides concurrency, shared memory communication, non-determinism, speculative parallelism, streams and pi...
متن کامل